Pseudocomplemented semilattices are finite-to-finite relatively universal
نویسندگان
چکیده
منابع مشابه
Finite pseudocomplemented lattices and 'permutoedre'
We study finite pseudocomplemented lattices and especially those that are also complemented. With regard to the classical results on arbitrary or distributive pseudocomplemented lattices the finiteness property allows to bring significant more precise details on the structural properties of such lattices. These results can especially be applied to the lattices defined by the "weak Bruhat order"...
متن کاملCongruence lattices of pseudocomplemented semilattices
Congruence lattices of algebras in various varieties have been studied extensively in the literature. For example, congruence lattices (i.e. lattices of ideals) of Boolean algebras were characterized by Nachbin [18] (see also Gratzer [9] and Jonsson [16]) while congruence lattices of semilattices were investigated by Papert [19], Dean and Oehmke [4] and others. In this paper we initiate the inv...
متن کاملRing-like Operations in Pseudocomplemented Semilattices
Ring-like operations are introduced in pseudocomplemented semilattices in such a way that in the case of Boolean pseudocomplemented semilattices one obtains the corresponding Boolean ring operations. Properties of these ring-like operations are derived and a characterization of Boolean pseudocomplemented semilattices in terms of these operations is given. Finally, ideals in the ring-like struct...
متن کاملTractable Constraints in Finite Semilattices
time algorithms for testing the satissability of propositional horn formulae. 21. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value-calculus using a stack of regions.
متن کاملTractable Constraints in Finite Semilattices
We introduce the notion of definite inequality constraints involving monotone functions in a finite meet-semJlattice, generalizing the logical notion of Horn-clauses, and we give a linear time algorithm for deciding satisfiability. We characterize the expressiveness of the framework of definite constraints and show that the algorithm uniformly solves exactly the set of all meet-closed relationa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra universalis
سال: 2008
ISSN: 0002-5240,1420-8911
DOI: 10.1007/s00012-008-2071-3